Method and apparatus for use in the design and manufacture of integrated circuits

ABSTRACT

A method and apparatus are provided for manufacturing integrated circuits performing invariant integer division x/d. A desired rounding mode is provided and an integer triple (a,b,k) for this rounding mode is derived. Furthermore, a set of conditions for the rounding mode is derived. An RTL representation is then derived using the integer triple. From this a hardware layout can be derived and an integrated circuit manufactured with the derived hardware layout. When the integer triple is derived a minimum value of k for the desired rounding mode and set of conditions is also derived.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority from GB App. No. 1117318.4, filed on Oct. 6, 2011, and which is incorporated by reference in its entirety herein.

BACKGROUND

1. Field

The following relates to methods and apparatus for use in the design and manufacture of integrated circuits, and particularly to the design and manufacture of circuits that perform divisions.

2. Related Art

When designing and manufacturing ICs, sophisticated synthesis tools such as Synopsis™ Design Compiler are used to convert a desired function which must be implemented in the IC into a set of logic gates to perform the functions. Functions which need to be implemented include add, subtract, multiply and divide. The synthesis tools seek to implement the desired functions in an efficient manner in logic gates.

The tools operate by converting a function to be implemented, such as divide by x, to what is known as register transfer level (RTL), which defines a circuit's behavior in terms of the flow of signals between hardware registers and the logical operations performed on these signals. This is then used to generate a high level representation of a circuit from which appropriate gate level representations and the ultimate IC design can be derived for manufacture, and an IC can then be made. If a synthesis tool is presented with division by a constant, it will invariably use RTL designed for non-constant division. A designer could note that in the case of constant division an implementation of the form (ax+b)/2^(k) could potentially make smaller ICs. The designer would then have to work out values for the triple (a,b,k) which would perform the task of x/d.

Division is acknowledged to be an expensive operation to perform in hardware. However in the case where the divisor is known to be a constant, efficient hardware implementations can be constructed. Consider the division of an unsigned n bit integer x by a known invariant integer constant d:

${\frac{x}{d}x} \in {\left\lbrack {0,{2^{n} - 1}} \right\rbrack d} \in N$

For the purposes of the exposition we will assume that d is an odd integer larger than 1, the following schemes can be easily modified for even d by those skilled in the art. We consider an implementation of the form:

$\frac{x}{d} \approx \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor$

Where a, b and k are non negative integers. Note that without loss of generality we can assume that a is odd. The prior art in the case where the rounding used is round towards zero and d is an unsigned m bit number comes from [1] and can be succinctly summarised setting:

$\left\lfloor \frac{x}{d} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor$ $t = \left\lfloor \frac{2^{n + m - 1}}{d} \right\rfloor$ k = n + m − 1 $\begin{matrix} {a = {\left( {{{d\left( {t + 1} \right)}{mod}\; 2^{n}} \leq 2^{m - 1}} \right)?}} & {{t + 1}:t} \\ {b = {\left( {{{d\left( {t + 1} \right)}{mod}\; 2^{n}} \leq 2^{m - 1}} \right)?}} & {0:t} \end{matrix}$

The second piece of prior art comes from [2] where the rounding mode used is round to nearest, d=2^(n)−1 and x is the result of a multiplication of two unsigned n bit numbers a and b:

$\left\lfloor {\frac{ab}{2^{n} - 1} + \frac{1}{2}} \right\rfloor = \left\lfloor \frac{\left( {2^{n} + 1} \right)\left( {{ab} + 2^{n - 1}} \right)}{2^{2n}} \right\rfloor$

When a division is to be performed such as divide by d, the integer triple discussed above is generated and provided to a RTL generation unit, which produces the gate level circuits required as an input to a synthesis tool which then generates the hardware components required for manufacture.

SUMMARY

Aspects include methods and apparatus to design an integrated circuit for performing invariant integer division for a desired rounding mode such as round towards zero, round to nearest and faithful rounding, and integrated circuits according to such design.

In an example, the necessary and sufficient conditions for a given integer triple of (a,b,k) to give the required answer for a desired rounding mode are produced. In the application of a hardware scheme an algorithm is presented which will fit into a synthesis flow and produce the most efficient hardware. In particular, we have appreciated that by representing integer division in the form (ax+b)/2^(k) and implementing this, rather than the conventional x/d division input to an RTL generator, that the division is implemented using a multiply-add implementation for various rounding modes. Three rounding modes are described here but the principle can be extended to any rounding mode. Using such an approach results in a hardware implementation for the division which can have up to a 50% decrease in integrated circuit area required.

In accordance with one aspect, there is provided a method for manufacturing an integrated circuit for performing invariant integer division (x/d) comprises: deriving a integer triple (a,b,k) for a desired rounding mode and set of conditions where x/d=(ax+d)/2^(k); deriving an RTL representation of the (ax+d)/2^(k) representation of the division using the integer triple; deriving a minimum value of k for a desired rounding mode and a set of conditions deriving a hardware layout from the RTL representation; and manufacturing an integrated circuit with the derived hardware layout.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a block diagram of circuitry embodying an example according to the disclosure.

FIG. 2 shows a method that can be implemented in examples according to the disclosure.

FIG. 3 depicts apparatus that can be used to implement aspects of the disclosure.

DETAILED DESCRIPTION

Exemplary aspects of the disclosure are described with reference to three rounding modes. Other rounding modes may also be implemented.

We first present the necessary and sufficient conditions for a given triple of (a,b,k) to implement each of the three following rounding schemes.

Round Towards Zero (RTZ)

In this case we require:

$\left\lfloor \frac{x}{d} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor$ $0 \leq {\frac{{ax} + b}{2^{k}} - \left( \frac{x - \left( {x\; {mod}\; d} \right)}{d} \right)} < 1$ ${{x\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}}} \leq {x\; {mod}\; d} < {{x\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}} + d}$

Now the sawtooth function x mod d is discontinuous in x with peaks at x=md−1 where 1≦m≦floor(2^(n)/d) and troughs at x=md for 0≦m≦floor(2^(n)/d). It suffices to check that the upper bound error condition is met for md −1 and the lower bound error condition is met for md:

$\begin{matrix} {{{{md}\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}}} \leq 0} & {{d - 1} < {{\left( {{md} - 1} \right)\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}} + d}} \\ {{m\left( {2^{k} - {ad}} \right)} \leq b} & {{m\left( {{ad} - 2^{k}} \right)} < {a - b}} \\ {{{where}\mspace{14mu} 0} \leq m \leq \left\lfloor \frac{2^{n}}{d} \right\rfloor} & {{{where}\mspace{14mu} 0} < m \leq \left\lfloor \frac{2^{n}}{d} \right\rfloor} \end{matrix}$

Now given that a and d is odd then ad−2^(k)≠0. Depending on the sign of ad−2^(k) different values of m will stress these inequalities. It follows that the necessary and sufficient conditions for the implementation of round towards zero mode for the IC design is:

$\left. \begin{matrix} {\left\lfloor \frac{x}{d} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor} \\ {x \in \left\lbrack {0,{2^{n} - 1}} \right\rbrack} \end{matrix}\Leftrightarrow\begin{matrix} {{- \frac{b + 1}{\left\lfloor {2^{n}/d} \right\rfloor}} < {{ad} - 2^{k}} < {a - b}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} < 0} \\ {{{ad} - 2^{k}} < \frac{a - b}{\left\lfloor {2^{''}/d} \right\rfloor}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} > 0} \end{matrix} \right.$

Round To Nearest (RTN)

In this case we require:

$\mspace{79mu} {\left\lfloor {\frac{x}{d} + \frac{1}{2}} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor}$ $\mspace{79mu} {0 \leq {\frac{{ax} + b}{2^{k}} - \left( \frac{\left( {{2x} + d} \right) - \left( {\left( {{2x} + d} \right){mod}\; d} \right)}{2d} \right)} < 1}$ ${{2{x\left( {1 - \frac{ad}{2^{k}}} \right)}} - \frac{bd}{2^{k - 1}} + d} \leq {\left( {{2x} + d} \right){mod}\; 2d} < {{2{x\left( {1 - \frac{ad}{2^{k}}} \right)}} - \frac{bd}{2^{k - 1}} + {3d}}$

Now the sawtooth function (2x+d) mod 2d is discontinuous in x with peaks at md−(d+1)/2 where 0<m≦floor((2^(n+1)+d−1)/2d) and troughs at md−(d−1)/2 for 0<m≦floor((2^(n+1)+d−3)/2d). It suffices to check the upper bound error condition is met for the peaks and the lower bound condition is met for the troughs:

$\begin{matrix} {{{2\left( {{md} - \frac{d - 1}{2}} \right)\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k - 1}} + d} \leq 1} & {{{2d} - 1} < {{2\left( {{md} - \frac{d + 1}{2}} \right)\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k - 1}} + {3d}}} \\ {{2{m\left( {2^{k} - {ad}} \right)}} \leq {{2b} - {a\left( {d - 1} \right)}}} & {{2{m\left( {{ad} - 2^{k}} \right)}} < {{a\left( {d + 1} \right)} - {2b}}} \\ {{{where}\mspace{14mu} 0} < m \leq \left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor} & {{{where}\mspace{14mu} 0} < m \leq \left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor} \end{matrix}$

Now given that a and d is odd then ad−2^(k)≠0. Depending on the sign of ad−2^(k) different values of m will stress these inequalities. It follows that the necessary and sufficient conditions for implementation of round towards nearest for the IC design is:

$\left. \begin{matrix} {\left\lfloor {\frac{x}{d} + \frac{1}{2}} \right\rfloor = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor} \\ {x \in \left\lbrack {0,{2^{''} - 1}} \right\rbrack} \end{matrix}\Leftrightarrow\begin{matrix} {\frac{{a\left( {d - 1} \right)} - {2b} - 1}{2\left\lfloor {{\left( {2^{n + 1} + d - 3} \right)/2}d} \right\rfloor} < {{ad} - 2^{k}} < {{a\left( \frac{d + 1}{2} \right)} - b}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} < 0} \\ {{{a\left( \frac{d - 1}{2} \right)} - b} \leq {{ad} - 2^{k}} < \frac{{a\left( {d + 1} \right)} - {2b}}{2\left\lfloor {{\left( {2^{n + 1} + d - 1} \right)/2}d} \right\rfloor}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} > 0} \end{matrix} \right.$

Faithful Rounding (FR1)

In this case we can return either integer that lies either side of the true side, if the true answer is an integer we must return that integer:

$\mspace{20mu} \begin{matrix} {{{Case}\mspace{14mu} x} = {md}} & {m = \left\lfloor \frac{{amd} + b}{2^{k}} \right\rfloor} \\ {0 \leq m \leq \left\lfloor {2^{n}/d} \right\rfloor} & {0 \leq {\frac{{amd} + b}{2^{k}} - m} < 1} \\ \; & {{- b} \leq {m\left( {{ad} - 2^{k}} \right)} < {2^{k} - b}} \end{matrix}$ $\begin{matrix} {{{Case}\mspace{14mu} x\; {mod}\; d} > 0} & {0 \leq {\frac{{ax} + b}{2^{k}}\left\lfloor \frac{x}{d} \right\rfloor} < 2} \\ \; & {{{x\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}}} \leq {x\; {mod}\; d} < {{x\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}} + {2d}}} \end{matrix}$

Now for the second case the sawtooth function x mod d is discontinuous in x with peaks at x=md−1 where 0<m≦floor(2^(n)/d) and troughs at x=md+1 (note we are assuming x≠md) for 0≦m≦floor(2^(n)/d). It suffices to check that the upper bound error condition is met for md−1 and the lower bound error condition is met for md+1:

$\begin{matrix} {{{\left( {{md} + 1} \right)\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}}} \leq 1} & {{d - 1} < {{\left( {{md} - 1} \right)\left( {1 - \frac{ad}{2^{k}}} \right)} - \frac{bd}{2^{k}} + {2d}}} \\ {{m\left( {2^{k} - {ad}} \right)} \leq {a + b}} & {{m\left( {{ad} - 2^{k}} \right)} < {2^{k} + a - b}} \\ {{{where}\mspace{14mu} 0} \leq m \leq \left\lfloor \frac{2^{n}}{d} \right\rfloor} & {{{where}\mspace{14mu} 0} < m \leq \left\lfloor \frac{2^{n}}{d} \right\rfloor} \end{matrix}$

Now given that a and d is odd then ad−2^(k)≠0. Depending on the sign of ad−2^(k) different values of m will stress these inequalities in the two cases. It follows that the necessary and sufficient conditions for implementation of faithful rounding is:

$\left. \begin{matrix} {{\left\lfloor \frac{x}{d}\; \right\rfloor \mspace{14mu} {or}\mspace{14mu} \left\lceil \frac{x}{d} \right\rceil} = \left\lfloor \frac{{ax} + b}{2^{k}} \right\rfloor} \\ {x \in \left\lbrack {0,{2^{''} - 1}} \right\rbrack} \end{matrix}\Leftrightarrow\begin{matrix} {{\left\lfloor {2^{n}/d} \right\rfloor \left( {2^{k} - {ad}} \right)} \leq b < 2^{k}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} < 0} \\ {{\left\lfloor {2^{n}/d} \right\rfloor \left( {{ad} - 2^{k}} \right)} < {2^{k} - b}} & {{{{if}\mspace{14mu} {ad}} - 2^{k}} > 0} \end{matrix} \right.$

Minimal Hardware Implementation Scheme

Minimal hardware implementations in the IC will result from minimising the number of partial product bits in ax+b. The scheme used achieves this as follows:

-   -   1 Minimise k producing kopt.     -   2 For the range of acceptable values of a for a given kopt         choose the one that results in the smallest constant multiplier.         This can be accomplished by choosing a value for a which has the         smallest number of non zero elements in a Canonical Signed Digit         representation of a. This will result in aopt. Define this         function as minCSD(x).     -   3 For the range of valid values for b having fixed kopt and aopt         choose the one with smallest Hamming weight, as this minimises         the number of partial products bits. If there are a range of         numbers that have smallest Hamming weight, we choose the one         that has smallest value as this will add 1s into the least         significant bits of the array where the height of the array is         smallest. Define the function which finds this value for numbers         in the interval [a, b] as minHamm(a, b). Note that the         minHamm(a, b) function can be computed as follows:

Input unsigned a[p−1:0],b[p−1:0] Output unsigned c[p−1:0] c=0 for i=p−1; i≧0; i−− loop if a[i]==b[i] then c[i]=a[i]; a[i]=0; else c+=2^(┌log) ² ^(a┐); break; endloop return c

Now applying this scheme to the space of allowable (a,b,k) as derived by the rounding mode and set of conditions we can construct a minimal hardware implementation for each of the three rounding schemes:

Rtz Minimal Hardware Implementation when ad−2^(K)>0

In this case we require:

${{ad} - 2^{k}} < \frac{a - b}{\left\lfloor {2^{n}/d} \right\rfloor}$

Now note that the right hand side is strictly decreasing in b. So for any valid a, b and k we can always set b=0 and then the condition will still be met, plus it will cost less hardware to implement. Hence a minimal hardware implementation will have b=0. Thus our condition reduces to:

(ad − 2^(k))⌊2^(n)/d⌋ < a $\frac{2^{k}}{d} < a < \frac{2^{k}\left\lfloor {2^{n}/d} \right\rfloor}{{d\left\lfloor {2^{n}/d} \right\rfloor} - 1}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min \left( {{k\text{:}\frac{1}{2^{k}}\left\lceil \frac{2^{k}}{d} \right\rceil} < \frac{\left\lfloor {2^{n}/d} \right\rfloor}{{d\left\lfloor {2^{n}/d} \right\rfloor} - 1}} \right)}$ $k_{opt} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} < {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - 1}} \right)}$

And kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{\left\lfloor {2^{n}/d} \right\rfloor}{{d\left\lfloor {2^{n}/d} \right\rfloor} - 1}$ ${2\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{2^{k_{opt}}\left\lfloor {2^{n}/d} \right\rfloor}{{d\left\lfloor {2^{n}/d} \right\rfloor} - 1}$ ${\left\lceil \frac{2^{k_{opt}}}{d} \right\rceil + 1} \geq \frac{2^{k_{opt}}\left\lfloor {2^{n}/d} \right\rfloor}{{d\left\lfloor {2^{n}/d} \right\rfloor} - 1}$

Hence a=ceil(2^(k) ^(opt) /d) is valid but a=ceil(2^(k) ^(opt) /d)+1 is not valid. It follows that the there is only valid value for a when k=kopt. We can now state that the design which minimises k and satisfies ad−2^(k)>0 is unique and is defined by:

$k_{opt}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - 1}} \right)}$ $a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil$ b_(opt)⁺ = 0

Rtz Minimal Hardware Implementation when ad−2^(K)<0

In this case we need:

${- \frac{b + 1}{\left\lfloor {2^{n}/d} \right\rfloor}} < {{ad} - 2^{k}} < {a - b}$

Hence b must necessarily be in the following interval:

b ∈[(2^(k)−ad)└2^(n)/d┘, 2^(k)+a−ad−1]

This interval must be non empty so:

2^(k) + a − ad > (2^(k) − ad)⌊2^(n)/d⌋ $\frac{2^{k}}{d} > a > \frac{2^{k}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{{d\left\lfloor {2^{n}/d} \right\rfloor} - d + 1}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{1}{2^{k}}\left\lfloor \frac{2^{k}}{d} \right\rfloor} > \frac{\left\lfloor {2^{n}/d} \right\rfloor - 1}{{d\left\lfloor {2^{n}/d} \right\rfloor} - d + 1}} \right)}$ $k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{2^{k}}{2^{k}{{mod}d}}} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - d + 1}} \right)}$

Where kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \leq \frac{\left\lfloor {2^{n}/d} \right\rfloor - 1}{{d\left\lfloor {2^{n}/d} \right\rfloor} - d + 1}$ ${2\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \leq \frac{2^{k_{opt}}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{{d\left\lfloor {2^{n}/d} \right\rfloor} - d + 1}$ ${\left\lceil \frac{2^{k_{opt}}}{d} \right\rceil - 1} \leq \frac{2^{k_{opt}}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{{d\left\lfloor {2^{n}/d} \right\rfloor} - d + 1}$

Hence a=floor(2^(k) ^(opt) /d) s valid but a=floor(2^(k) ^(opt) /d)−1 is not valid. It follows that the there is only valid value for a when k=kopt. We can now state that the design which minimises k and satisfies ad−2^(k)<0 is unique in k and a and is defined by:

$k_{opt}^{-} = {\min\left( {{k\text{:}\mspace{14mu} \frac{2^{k}}{2^{k}\; {mod}\; d}} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - d + 1}} \right)}$ $a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor$ b_(opt)⁻ = min   Hamm((2^(k_(opt)⁻) − a_(opt)⁻d)⌊2^(n)/d⌋, 2^(k_(opt)⁻) − a_(opt)⁻(d − 1) − 1)

Where minHamm(a, b) returns the number of smallest value from the numbers of smallest Hamming weight found within the interval [a, b].

Rtz Minimal Hardware Design

Summarising the previous sections we have the following algorithm:

$k_{opt}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - 1}} \right)}$ $a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil$ b_(opt)⁺ = 0 $k_{opt}^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - d + 1}} \right)}$ $a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor$ b_(opt)⁻ = min  Hamm((2^(k_(opt)⁻) − a_(opt)⁻d)⌊2^(n)/d⌋, 2^(k_(opt)⁻) − a_(opt)⁻(d − 1) − 1) {k_(opt), a_(opt), b_(opt)} = (k_(opt)⁺ < k_(opt)⁻)?  {k_(opt)⁺, a_(opt)⁺, b_(opt)⁺} : {k_(opt)⁻, a_(opt)⁻, b_(opt)⁻}

Note that kopt⁺ is never equal to kopt⁻, otherwise if kopt=kopt⁺=kopt⁻ then:

$\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - 1} \geq \frac{2^{k - 1}}{\left( {- 2^{k - 1}} \right){mod}\; d}$ $\frac{2^{k}}{2^{k}{mod}\; d} > {{d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - d + 1} \geq \frac{2^{k - 1}}{2^{k - 1}{mod}\; d}$

Simplifying these two conditions we get:

2((−2^(k−1))mod d)>(−2^(k))mod d

2(2^(k−1)mod d)>2^(k) mod d

2(2^(k−1)mod d)>2^(k) mod d>2(2^(k−1) mod d)−d

This is a contradiction as 2^(k) mod d is equal to one of these limits.

Rtn Minimal Hardware Implementation when ad−2^(K)>0

In this case we need:

${{a\left( \frac{d - 1}{2} \right)} - b} \leq {{ad} - 2^{k}} < \frac{{a\left( {d + 1} \right)} - {2b}}{2\left\lfloor {{\left( {2^{n + 1} + d - 1} \right)/2}d} \right\rfloor}$

Hence b must necessarily be in the following interval:

$b \in \left\lbrack {{{a\left( \frac{d - 1}{2} \right)} + 2^{k} - {ad}},{{a\left( \frac{d + 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor} - 1}} \right\rbrack$

This interval must be non empty so:

${{a\left( \frac{d + 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor}} > {{a\left( \frac{d - 1}{2} \right)} + 2^{k} - {ad}}$ $\frac{2^{k}}{d} < a < \frac{2^{k}\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor} - 1}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{1}{2^{k}}\left\lceil \frac{2^{k}}{d} \right\rceil} < \frac{\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor} - 1}} \right)}$ $k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{2^{k}}{\left( {- 2^{k}} \right)\; {{mod}d}}} > {{d\left\lfloor \frac{2^{n + 1} - d - 1}{2d} \right\rfloor} - 1}} \right)}$

Where kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor} - 1}$ ${2\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{2^{k_{opt}}\left( {{\left\lfloor {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor} - 1}$ ${\left\lceil \frac{2^{k_{opt}}}{d} \right\rceil + 1} \geq \frac{2^{k_{opt}}\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 1} \right)/2}d} \right\rfloor} - 1}$

Hence a=ceil(2^(k) ^(opt) /d) is valid but a=ceil(2^(k) ^(opt) /d)+1 is not valid. It follows that the there is only valid value for a when k=kopt. The design which minimises k and satisfies ad−2^(k)>0 is unique and is defined by:

$\mspace{79mu} {k_{opt}^{+} = {\min\left( {{k\text{:}\mspace{14mu} \frac{2^{k}}{\left( {- 2^{k}} \right)\; {mod}\; d}} > {{d\left\lfloor \frac{2^{n + 1} - d - 1}{2d} \right\rfloor} - 1}} \right)}}$ $\mspace{79mu} {a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil}$ $b_{opt}^{+} = {\min \mspace{14mu} {{Hamm}\left( {{{a_{opt}^{+}\left( \frac{d - 1}{2} \right)} + 2^{k_{opt}^{+}} - {a_{opt}^{+}d}},{{a_{opt}^{+}\left( \frac{d + 1}{2} \right)} + {\left( {2^{k_{opt}^{+}} - {a_{opt}^{+}d}} \right)\left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor} - 1}} \right)}}$

Where minHamm(a, b) returns the number of smallest value from the numbers of smallest Hamming weight found within the interval [a, b].

Rtn Minimal Hardware Implementation when ad−2^(K)<0

In this case we need:

$\frac{{a\left( {d - 1} \right)} - {2b} - 1}{2\left\lfloor {{\left( {2^{n + 1} + d - 3} \right)/2}d} \right\rfloor} < {{ad} - 2^{k}} < {{a\left( \frac{d + 1}{2} \right)} - b}$

Hence b must necessarily be in the following interval:

$b \in \left\lbrack {{{a\left( \frac{d - 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor}},{{a\left( \frac{d + 1}{2} \right)} + 2^{k} - {ad} - 1}} \right\rbrack$

This interval must be non empty so:

${{a\left( \frac{d + 1}{2} \right)} + 2^{k} - {ad}} > {{a\left( \frac{d - 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor}}$ $\frac{2^{k}}{d} > a > \frac{2^{k}\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor} + 1}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{1}{2^{k}}\left\lfloor \frac{2^{k}}{d} \right\rfloor} > \frac{\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor} + 1}} \right)}$ $k_{opt} = {\min\left( {{k\text{:}\mspace{14mu} \frac{2^{k}}{2^{k}\; {{mod}d}}} > {{d\left\lfloor \frac{2^{n + 1} - d - 3}{2d} \right\rfloor} + 1}} \right)}$

Where kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lfloor \frac{2^{k_{opt} - 1}}{d} \right\rfloor} \leq \frac{\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor}{{d{\left\lfloor \left( {2^{n + 1} - d - 3} \right) \right\rfloor/2}d} + 1}$ ${2\left\lfloor \frac{2^{k_{opt} - 1}}{d} \right\rfloor} \leq \frac{2^{k_{opt}}\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor} + 1}$ ${\left\lfloor \frac{2^{k_{opt}}}{d} \right\rfloor - 1} \leq \frac{2^{k_{opt}}\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor}{{d\left\lfloor {{\left( {2^{n + 1} - d - 3} \right)/2}d} \right\rfloor} + 1}$

Hence a=floor(2^(k) ^(opt) /d) is valid but a=floor(2^(k) ^(opt) /d)−1 is not valid. It follows that the there is only valid value for a when k=kopt. The design which minimises k and satisfies ad−2^(k)<0 is unique in k and a and is defined by:

$k_{opt}^{-} = {\min\left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > {{d\left\lfloor \frac{2^{n + 1} - d - 3}{2d} \right\rfloor} + 1}} \right)}$ $a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor$ $b_{opt}^{-} = {\min \; {{Hamm}\begin{pmatrix} {{{a_{opt}^{-}\left( \frac{d - 1}{2} \right)} + {\left( {2^{k_{opt}^{-}} - {a_{opt}^{-}d}} \right)\left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor}},} \\ {{a_{opt}^{-}\left( \frac{d + 1}{2} \right)} + 2^{k_{opt}^{-}} - {a_{opt}^{-}d} - 1} \end{pmatrix}}}$

Where minHamm(a, b) returns the number of smallest value from the numbers of smallest Hamming weight found within the interval [a, b].

Rtn Minimal Hardware Design

Summarising the previous sections results in the following algorithm:

$\begin{matrix} {{k_{opt}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > {{d\left\lfloor \frac{2^{n + 1} - d - 1}{2d} \right\rfloor} - 1}} \right)}}{a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil}{b_{opt}^{+} = {\min \; {{Hamm}\left( {{{a_{opt}^{+}\left( \frac{d - 1}{2} \right)} + 2^{k_{opt}^{+}} - {a_{opt}^{+}d}},{{a_{opt}^{+}\left( \frac{d + 1}{2} \right)} + {\left( {2^{k_{opt}^{+}} - {a_{opt}^{+}d}} \right)\left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor} - 1}} \right)}}}{k_{opt}^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > {{d\left\lfloor \frac{2^{n + 1} - d - 3}{2d} \right\rfloor} + 1}} \right)}}{a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor}{b_{opt}^{-} = {\min \; {{Hamm}\left( {{{a_{opt}^{-}\left( \frac{d - 1}{2} \right)} + {\left( {2^{k_{opt}^{-}} - {a_{opt}^{-}d}} \right)\left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor}},{{a_{opt}^{-}\left( \frac{d + 1}{2} \right)} + 2^{k_{opt}^{-}} - {a_{opt}^{-}d} - 1}} \right)}}}} \\ {\left\{ {k_{opt},a_{opt},b_{opt}} \right\} = {{\left( {k_{opt}^{+} < k_{opt}^{-}} \right)?\mspace{14mu} \left\{ {k_{opt}^{+},a_{opt}^{+},b_{opt}^{+}} \right\}}:\left\{ {k_{opt}^{-},a_{opt}^{-},b_{opt}^{-}} \right\}}} \end{matrix}$

Note that kopt is never equal to kopt, otherwise if kopt=kopt=kopt then:

$\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d} > {{d\left\lfloor \frac{2^{n + 1} - d - 1}{2d} \right\rfloor} - 1} \geq \frac{2^{k - 1}}{\left( {- 2^{k - 1}} \right){mod}\; d}$ $\frac{2^{k}}{2^{k}{mod}\; d} > {{d\left\lfloor \frac{2^{n + 1} - d - 3}{2d} \right\rfloor} + 1} \geq \frac{2^{k - 1}}{2^{k - 1}{mod}\; d}$

Simplifying these two conditions we get:

2((−2^(k−1))mod d)>(−2^(k))mod d

2(2^(k−1)mod d)>2^(k)mod d

2(2^(k−1)mod d)>2^(k) mod d>2(2^(k−1)mod d)−d

This is a contradiction as 2^(k) mod d is equal to one of these limits.

FR1 Minimal Hardware Implementation when ad−2^(K)>0

In this case we require:

└2^(n)/d┘(ad−2^(k))<2^(k)−b

Now note that the right hand side is strictly decreasing in b. So for any valid a, b and k we can always set b=0 and then condition will still be met, plus cost less hardware to implement. Hence minimal hardware implementations will have b=0. Thus our condition reduces to:

⌊2^(n)/d⌋(ad − 2^(k)) < 2^(k) $\frac{2^{k}}{d} < a < \frac{2^{k}\left\lceil {2^{n}/d} \right\rceil}{d\left\lfloor {2^{n}/d} \right\rfloor}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min \left( {{k\text{:}\frac{1}{2^{k}}\left\lceil \frac{2^{k}}{d} \right\rceil} < \frac{\left\lceil {2^{n}/d} \right\rceil}{d\left\lfloor {2^{n}/d} \right\rfloor}} \right)}$ $k_{opt} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$

Where kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{\left\lceil {2^{n}/d} \right\rceil}{d\left\lfloor {2^{n}/d} \right\rfloor}$ ${2\left\lceil \frac{2^{k_{opt} - 1}}{d} \right\rceil} \geq \frac{2^{k_{opt}}\left\lceil {2^{n}/d} \right\rceil}{d\left\lfloor {2^{n}/d} \right\rfloor}$ ${\left\lceil \frac{2^{k_{opt}}}{d} \right\rceil + 1} \geq \frac{2^{k_{opt}}\left\lceil {2^{n}/d} \right\rceil}{d\left\lfloor {2^{n}/d} \right\rfloor}$

Hence a=ceil(2^(k) ^(opt) /d) is valid but a=ceil(2^(k) ^(opt) /d)+1 is not valid. It follows that the there is only a valid value for a when k=kopt. We can now state that the design which minimises k and satisfies ad−2^(k)>0 is unique and is defined by:

$k_{opt}^{+} = {\min\left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$ $a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil$ b_(opt)⁺ = 0

FR1 Minimal Hardware Implementation when ad−2^(K)<0

In this case we need:

└2^(n)/d┘(2^(k)−ad)≦b<2^(k)

Now b must live in a non empty interval so:

2^(k) > ⌊2^(n)/d⌋(2^(k) − ad) $\frac{2^{k}}{d} > a > \frac{2^{k}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{d\left\lfloor {2^{n}/d} \right\rfloor}$

Given that a must be an integer we have a formula for kopt:

$k_{opt} = {\min \left( {{k\text{:}\frac{1}{2^{k}}\left\lfloor \frac{2^{k}}{d} \right\rfloor} < \frac{\left\lfloor {2^{n}/d} \right\rfloor - 1}{d\left\lfloor {2^{n}/d} \right\rfloor}} \right)}$ $k_{opt} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$

Where kopt is the smallest such valid k hence:

${\frac{1}{2^{k_{opt} - 1}}\left\lfloor \frac{2^{k_{opt} - 1}}{d} \right\rfloor} \leq \frac{\left\lfloor {2^{n}/d} \right\rfloor - 1}{d\left\lfloor {2^{n}/d} \right\rfloor}$ ${2\left\lfloor \frac{2^{k_{opt} - 1}}{d} \right\rfloor} \leq \frac{2^{k_{opt}}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{d\left\lfloor {2^{n}/d} \right\rfloor}$ ${\left\lfloor \frac{2^{k_{opt}}}{d} \right\rfloor - 1} \leq \frac{2^{k_{opt}}\left( {\left\lfloor {2^{n}/d} \right\rfloor - 1} \right)}{d\left\lfloor {2^{n}/d} \right\rfloor}$

Hence a=floor(2^(k) ^(opt) /d) is valid but a=floor(2^(k) ^(opt) /d)−1 is not valid. It follows that the there is only a valid value for a when k=kopt. We can now state that the design which minimises k and satisfies ad−2^(k)<0 is unique in k and a and is defined by:

$k_{opt}^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$ $a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor$ b_(opt)⁻ = min  Hamm((2^(k_(opt)⁻) − a_(opt)⁻d)⌊2^(n)/d⌋, 2^(k_(opt)⁻) − 1)

Where minHamm(a, b) returns the number of smallest value from the numbers of smallest Hamming weight found within the interval [a, b].

FR1 Minimal Hardware Design

Summarising the previous sections we have the following algorithm:

$k_{opt}^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$ $a_{opt}^{+} = \left\lceil \frac{2^{k_{opt}^{+}}}{d} \right\rceil$ b_(opt)⁺ = 0 $k_{opt}^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > \left\lfloor \frac{2^{n}}{d} \right\rfloor} \right)}$ $a_{opt}^{-} = \left\lfloor \frac{2^{k_{opt}^{-}}}{d} \right\rfloor$ b_(opt)⁻ = min  Hamm((2^(k_(opt)⁻) − a_(opt)⁻d)⌊2^(n)/d⌋, 2^(k_(opt)⁻) − 1) {k_(opt), a_(opt), b_(opt)} = (k_(opt)⁺ < k_(opt)⁻)?  {k_(opt)⁺, a_(opt)⁺, b_(opt)⁺} : {k_(opt)⁻, a_(opt)⁻, b_(opt)⁻}

Note that kopt⁺ is never equal to kopt⁻, else if kopt=kopt⁺=kopt⁻ then:

$\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d} > \left\lfloor \frac{2^{n}}{d} \right\rfloor \geq \frac{2^{k - 1}}{\left( {- 2^{k - 1}} \right){mod}\; d}$ $\frac{2^{k}}{2^{k}{mod}\; d} > \left\lfloor \frac{2^{n}}{d} \right\rfloor \geq \frac{2^{k - 1}}{2^{k - 1}{mod}\; d}$

Simplifying these two conditions we get:

2((−2^(k−1))mod d)>(−2^(k))mod d

2(^(k−1) mod d)>2^(k) mod d

2(2^(k−1) mod d)>2^(k) mod d>2(2^(k−1) mod d)−d

This is a contradiction as 2^(k) mod d is equal to one of these limits.

Invariant Integer Division Synthesiser

Example structure of a synthesis apparatus according to the disclosure that performs invariant integer division is depicted in FIG. 1.

This shows a parameter creation unit 2 which has three inputs n, d and rounding mode. n is the number of bits to be used in the numerator of the division, d is the divisor, and the rounding mode is a selection of one of a plurality of rounding modes. Three examples are given here but others are possible.

The parameter creation unit 2 generates in dependence on the inputs n, d, and rounding mode, the integer triple (a, b, k) required by an RTL generator k to generate an appropriate RTL representation of the circuitry for performing the division for the said number of bits of n and rounding mode, and for additional conditions provided to the RTL generation. The RTL generator is computer controlled to generate an RTL representation of a division for the integer triple using additional conditions such as ad−2^(k)<0.

The RTL representation is then output to a synthesis tool 6 which generates the hardware circuits required to implement the division on an appropriate part of an integrated circuit.

The algorithm in the parameter creation may be summarised as:

     {k, a, b} = (k⁺ < k⁻)?{k⁺, a⁺, min  Hamm(Y⁺(k⁺, a⁺))} : {k⁻, a⁻, min  Hamm(Y⁻(k⁻, a⁻))}      Where $\mspace{79mu} {k^{+} = {\min \left( {{k\text{:}\frac{2^{k}}{\left( {- 2^{k}} \right){mod}\; d}} > X^{+}} \right)}}$ $\mspace{79mu} {k^{-} = {\min \left( {{k\text{:}\frac{2^{k}}{2^{k}{mod}\; d}} > X^{-}} \right)}}$ $\mspace{79mu} {a^{+} = \left\lceil \frac{2^{k^{+}}}{d} \right\rceil}$ $\mspace{79mu} {a^{-} = \left\lfloor \frac{2^{k^{-}}}{d} \right\rfloor}$      And

RTZ RTN FR1 X⁺ ${d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - 1$ ${d\left\lfloor \frac{2^{n + 1} - d - 1}{2d} \right\rfloor} - 1$ $\left\lfloor \frac{2^{n}}{d} \right\rfloor$ X⁻ ${d\left\lfloor \frac{2^{n}}{d} \right\rfloor} - d + 1$ ${d\left\lfloor \frac{2^{n + 1} - d - 3}{2d} \right\rfloor} + 1$ $\left\lfloor \frac{2^{n}}{d} \right\rfloor$ Y⁺(k, a) (0, 0) $\quad\begin{pmatrix} {{{a\left( \frac{d - 1}{2} \right)} + 2^{k} - {ad}},} \\ {{a\left( \frac{d - 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 1}{2d} \right\rfloor} - 1} \end{pmatrix}$ (0, 0) Y⁻(k, a) $\quad\begin{pmatrix} {{\left( {2^{k} - {ad}} \right)\left\lfloor {2^{n}/d} \right\rfloor},} \\ {2^{k} - {a\left( {d - 1} \right)} - 1} \end{pmatrix}$ $\quad\begin{pmatrix} {{{a\left( \frac{d - 1}{2} \right)} + {\left( {2^{k} - {ad}} \right)\left\lfloor \frac{2^{n + 1} + d - 3}{2d} \right\rfloor}},} \\ {{{a\left( \frac{d - 1}{2} \right)} + 2^{k} - {ad} - 1},} \end{pmatrix}$ $\quad\begin{pmatrix} {{\left( {2^{k} - {ad}} \right)\left\lfloor {2^{n}/d} \right\rfloor},} \\ {2^{k} - 1} \end{pmatrix}$

Specific Example of the Idea: Application to the Multiplication of Normalised Numbers

An unsigned n bit normalised number x is interpreted as holding the value x/(2^(n)−1). Multiplication of these numbers thus involves computing the following:

$\frac{y}{2^{n} - 1} \approx {\frac{a}{2^{n} - 1}\frac{b}{2^{n} - 1}}$ $y \approx \frac{ab}{2^{n} - 1}$

We can apply the previously found results to implementing this design for the three rounding modes. In this case d=2^(n)−1 and given that ab≦(2^(n)−1)² then 2^(n)−1 in the previous sections will be replaced by (2²−1)². Substituting these values into the previous sections gives rise to the following three rounding:

${{RTZ}\left( \frac{ab}{2^{n} - 1} \right)} = \left\lfloor \frac{{\left( {2^{n} + 1} \right){ab}} + 2^{n}}{2^{2n}} \right\rfloor$ ${{RTN}\left( \frac{ab}{2^{n} - 1} \right)} = \left\lfloor \frac{\left( {2^{n} + 1} \right)\left( {{ab} + 2^{n - 1}} \right)}{2^{{2n}\;}} \right\rfloor$ ${{FR}\; 1\left( \frac{ab}{2^{n} - 1} \right)} = \left\lfloor \frac{{ab} + 2^{n} - 1}{2^{n}} \right\rfloor$

Note that the RTN case gives a generalisation and proof of the formula for such mulitplication [2]. Note that the allowable interval for the additive constant in each case is [2^(n)−1, 2^(n)+1], [2^(n−1)(2^(n)+1)−2, 2^(n−1)(2^(n)+1)] and no freedom for the FR1 case.

Alternative Implementations

Further implementations can be realized by those skilled in the art based on the following disclosures, to deal with the following situations:

-   -   1) d is even. Note that if d is a power of 2 then we have the         trivial implementations:

${{{RTZ}\left( \frac{x}{d} \right)} = {{{FR}\; 1\left( \frac{x}{d} \right)} = x}}\operatorname{>>}\; {\log_{2}(d)}$ ${{{RTN}\left( \frac{x}{d} \right)} = \left( {x + {d/2}} \right)}\operatorname{>>}{\log_{2}(d)}$

-   -   2) If x lives in the interval [0,max] and not [0,2^(n)−1] then         it suffices to replace 2^(n) the formulae above with max+1.     -   3) If x can take negative the formulae can be reworked using the         framework established above.     -   4) Other rounding modes—the formulae can be reworked using the         framework established above.     -   5) The hardware scheme has been chosen to minimize the size of         the final shift—a different scheme could be applied which would         result in different equations for optimal a, b and k.

In summary of the above, FIG. 1 depicts an example where a parameter creator inputs n, d, and a desired rounding mode, and outputs integer triple a, b, and k. An RTL generator 11 receives the a, b, and k. RTL generator 11 generates RTL for (a*x+b)>>k according to the parameters. The generated RTL is input to a synthesis tool 12, which outputs a hardware layout that can be fabricated in a fabrication process.

FIG. 2 depicts an example method, where integer triple (a, b, k) is derived 15 for a rounding mode and conditions. At 16, a minimum value of k is derived (16 is depicted separately from 15, for ease of explanation). At 17, an RTL representation of (ax+b)/2̂k is derived. At 18, a hardware layout is derived from the RTL. At 19, a circuit can be manufactured according to the hardware layout.

FIG. 3 depicts exemplary apparatus in which methods can be implemented. A processor 25 interfaces with a user interface 30 and with a display 32. A RAM 26 and non-volatile storage 28 interfaces with processor 25. These memories are tangible memories that can store instructions for configuring processor 25 to perform aspects of the disclosure. 

We claim:
 1. A method for manufacturing an integrated circuit for performing invariant integer division x/d comprising: deriving an integer triple (a,b,k) for a desired rounding mode and set of conditions wherein Round(x/d)=(ax+b)/2^(k); deriving an RTL representation of (ax+b)/2^(k) using the integer triple; submitting the RTL representation for derivation of a hardware layout from the RTL representation, wherein the deriving of the integer triple (a, b, k) comprises deriving a minimum value of k for the desired rounding mode and set of conditions when deriving the integer triple.
 2. A method according to claim 1 in which the rounding mode is round towards zero.
 3. A method according to claim 1 in which the rounding mode is round to nearest.
 4. A method according to claim 1 in which the rounding mode is faithful rounding.
 5. A method according to claim 1, further comprising deriving a value for b for the previously derived values of k and a, which has the smallest Hamming weight and in value.
 6. An apparatus for manufacturing an integrated circuit for performing invariant integer division x/d comprising: a module for deriving an integer triple (a,b,k) for a desired rounding mode and a set of conditions where Round(x/d)=(ax+b)/2^(k;), where k is derived to be a minimum value for the desired rounding mode and the set of conditions; a module for deriving a RTL representation of (ax+b)/2^(k) using the integer triple and for submitting the RTL representation to a module for deriving a hardware layout from the RTL representation.
 7. An apparatus according to claim 6, wherein the module for deriving the integer triple also is operable to derive a value for b from the values of a and k, wherein said value for b has a lowest Hamming weight and value.
 8. An apparatus according to claim 6, wherein the desired rounding mode is round towards zero.
 9. An apparatus according to claim 6, wherein the desired rounding mode is round to nearest.
 10. An apparatus according to claim 6, wherein the desired rounding mode is faithful rounding.
 11. A tangible computer readable medium storing computer executable instructions for a method used in designing an integrated circuit for performing invariant integer division x/d, the method comprising: deriving an integer triple (a,b,k) for a desired rounding mode and set of conditions wherein Round(x/d)=(ax+b)/2^(k); deriving an RTL representation of (ax+b)/2^(k) using the integer triple; deriving a hardware layout from the RTL representation; and deriving a minimum value of k for the desired rounding mode and set of conditions when deriving the integer triple.
 12. A tangible computer readable medium according to claim 11, wherein for the method, the rounding mode is round towards zero.
 13. A tangible computer readable medium according to claim 11, wherein for the method, the rounding mode is round to nearest.
 14. A tangible computer readable medium according to claim 11, wherein for the method, the rounding mode is faithful rounding.
 15. A tangible computer readable medium according to claim 11, wherein the method further comprises deriving a value for b for the previously derived values of k and a, which has the smallest Hamming weight and in value. 